A note on nonisomorphic cospectral digraphs
نویسندگان
چکیده
منابع مشابه
A note on non-R-cospectral graphs
Two graphs G and H are called R-cospectral if A(G)+yJ and A(H)+yJ (where A(G), A(H) are the adjacency matrices of G and H, respectively, J is the all-one matrix) have the same spectrum for all y ∈ R. In this note, we give a necessary condition for having R-cospectral graphs. Further, we provide a sufficient condition ensuring only irrational orthogonal similarity between certain cospectral grap...
متن کاملA note on arc-transitive circulant digraphs
We prove that, for a positive integer n and subgroup H of automorphisms of a cyclic group Z of order n, there is up to isomorphism a unique connected circulant digraph based on Z admitting an arc-transitive action of ZzH. We refine the Kovács–Li classification of arc-transitive circulants to determine those digraphs with automorphism group larger than ZzH. As an application we construct, for ea...
متن کاملNote on Perfect Forests in Digraphs
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF (x) of each vertex x in F is odd, and each tree of F is an induced subgraph of G. Alex Scott (Graphs & Combin., 2001) proved that every connected graph G contains a perfect forest if and only if G has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect for...
متن کاملA Note on the Order of Iterated Line Digraphs
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k-iterated line digraph L (G), for k ≥ 0, where L(G) = G. We obtain this result by using the minimal polynomial of a quotient digraph π(G) of G. We show some examples of this method applied to the so-called cyclic Kautz, the unicyclic, and the acyclic digraphs. In the first case, our ...
متن کاملA note on an extension of facet - de ning digraphs
In this paper we present suucient conditions for unweighted digraphs to induce facet-deening inequalities of the linear ordering polytope P n. We introduce constructive operations (Identiication (of nodes),5-Extension) for generating new facets of P n by using already known facets. The identiication generates new digraphs by identiication two nodes of the source di-graph and presented for arbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1974
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90045-8